On Self-Duality of Branchwidth in Graphs of Bounded Genus
نویسندگان
چکیده
A graph parameter is self-dual in some class of graphs embeddable in some surface if its value does not change in the dual graph more than a constant factor. Self-duality has been examined for several width-parameters, such as branchwidth, pathwidth, and treewidth. In this paper, we give a direct proof of the self-duality of branchwidth in graphs embedded in some surface. In this direction, we prove that bw(G∗) ≤ 6 · bw(G) + 2g − 4 for any graph G embedded in a surface of Euler genus g.
منابع مشابه
The Effect of Planarization on Width
We study the effects of planarization (the construction of a planar diagram D from a non-planar graph G by replacing each crossing by a new vertex) on graph width parameters. We show that for treewidth, pathwidth, branchwidth, clique-width, and tree-depth there exists a family of n-vertex graphs with bounded parameter value, all of whose planarizations have parameter value Ω(n). However, for ba...
متن کاملSome properties of analytic functions related with bounded positive real part
In this paper, we define new subclass of analytic functions related with bounded positive real part, and coefficients estimates, duality and neighborhood are considered.
متن کامل(Total) Vector Domination for Graphs with Bounded Branchwidth
Given a graph G = (V, E) of order n and an n-dimensional non-negative vector d = (d(1), d(2), . . . , d(n)), called demand vector, the vector domination (resp., total vector domination) is the problem of finding a minimum S ⊆ V such that every vertex v in V \S (resp., in V ) has at least d(v) neighbors in S. The (total) vector domination is a generalization of many dominating set type problems,...
متن کاملGeneration of Graphs with Bounded Branchwidth
Branchwidth is a connectivity parameter of graphs closely related to treewidth. Graphs of treewidth at most k can be generated algorithmically as the subgraphs of k-trees. In this paper, we investigate the family of edge-maximal graphs of branchwidth k, that we call k-branches. The k-branches are, just as the k-trees, a subclass of the chordal graphs where all minimal separators have size k. Ho...
متن کاملBranch-Width and Well-Quasi-Ordering in Matroids and Graphs
We prove that a class of matroids representable over a fixed finite field and with bounded branch-width is well-quasi-ordered under taking minors. With some extra work, the result implies Robertson and Seymour’s result that graphs with bounded tree-width (or equivalently, bounded branch-width) are well-quasi-ordered under taking minors. We will not only derive their result from our result on ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 159 شماره
صفحات -
تاریخ انتشار 2009